Representation of Requirements through Preference Orderings of Soft Constraints

نویسنده

  • Harald Meyer
چکیده

Constraint satisfaction problems have generally been recognized as a useful framework for many AI problems. Several notions of soft constraints have been suggested to infer uncertain knowledge as well as formulate optimization tasks. Additionally, the ability to represent optional requirements of experts on schedules or plans has been claimed by certain forms of soft constraints. In opposition this paper shows, that the problem of representing optional requirements is not solved, yet. This problem must especially not mixed up with the representation of uncertain knowledge. This insight is founded by practical experience as well as theoretical re ections. On the one hand, we worked on a nurse scheduling application, that demanded the representation of more or less important requirements of nurses. On the other hand, we developed a unifying view on the well known notions of soft constraints, i.e. weighted and prioritized constraints and constraint hierarchies. Then, from this view we formulated some conditions for representations of optional requirements. Thus, a (preliminary) set of criteria is obtained to assess, whether a formalism is appropriate to represent requirements in scheduling or con guration systems. Finally, the several notions of soft constraints are discussed with respect to theses criteria. 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representation of Requirements Through Preference

Constraint satisfaction problems have generally been recognized as a useful framework for the representation of many AI problems. Several notions of soft constraints have been suggested to infer uncertain knowledge as well as formulate optimization tasks. Additionally, the ability to represent it optional expert requirements on schedules or plans by certain forms of soft constraints has been cl...

متن کامل

A Study on Preference Orderings of Mathematical expectation, Expected Utility and Distorted Expectation

One of the challenges for decision-makers in insurance and finance is choosing the appropriate criteria for making decisions. Mathematical expectation, expected utility, and distorted expectation are the three most common measures in this area. In this article, we study these three criteria, and by providing some examples, we review and compare the decisions made by each measure.

متن کامل

Concordance and the Smallest Covering Set of Preference Orderings

Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the mutual information and extracting the common patterns in a set of preference orderings are key to these areas. In this paper we deal with the representation of ...

متن کامل

A new proposal for fusing individual preference orderings by rank-ordered agents: A generalization of the Yager's algorithm

The problem of the aggregation of multi-agents preference orderings has received considerable attention in the scientific literature, because of its importance for different fields of research. Yager (2001) proposed an algorithm for addressing this problem when the agents’ importance is expressed through a rank-ordering, instead of a set of weights. The algorithm by Yager is simple and automata...

متن کامل

Conditional Lexicographic Orders in Constraint Satisfaction Problems

The lexicographically-ordered CSP (“lexicographic CSP” or “LO-CSP” for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Preferences are defined by a total ordering across all assignments, such that a change in assignment to a given variable is more important than any change in assignment to any less important variable. In this paper, we s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996